Rainbow Ramsey simple structures
نویسندگان
چکیده
A relational structure R is rainbow Ramsey if for every finite induced substructure C of R and every colouring of the copies of C with countably many colours, such that each colour is used at most k times for a fixed k, there exists a copy R∗ of R so that the copies of C in R∗ use each colour at most
منابع مشابه
The strength of the rainbow Ramsey Theorem
The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey’s Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ra...
متن کاملRainbow Ramsey Theory
This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic progressions in [n] and N. A general perspective on other rainbow Ramsey type problems is given.
متن کاملRainbow Arithmetic Progressions and Anti-Ramsey Results
The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distin...
متن کاملSize and Degree Anti-Ramsey Numbers
A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-Ramsey number of H, denoted by ARs(H), is the smallest number of edges in a graph G such that any of its proper edge-colorings contains a rainbow copy of H. We show that ARs(Kk) = Θ(k / log k). This settles a problem of Axenovich, Knauer, Stumpp and Ueckerdt. The proof is proba...
متن کاملRainbow numbers for small stars with one edge added
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H . The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of Kn with rb(n, H) number of colors contains a rainbow copy o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016